A fast algorithm to generate necklaces with fixed content
نویسندگان
چکیده
منابع مشابه
A fast algorithm to generate necklaces with fixed content
We develop a fast algorithm for listing all necklaces with &xed content. By &xed content, we mean the number of occurrences of each alphabet symbol is &xed. Initially, we construct a simple but ine4cient algorithm by making some basic modi&cations to a recursive necklace generation algorithm. We then improve it by using two classic combinatorial optimization techniques. An analysis using straig...
متن کاملFast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
Many applications call for exhaustive lists of strings subject to various constraints, such as inequivalence under group actions. A k-ary necklace is an Ž . equivalence class of k-ary strings under rotation the cyclic group . A k-ary unlabeled necklace is an equivalence class of k-ary strings under rotation and permutation of alphabet symbols. We present new, fast, simple, recursive algoŽ . rit...
متن کاملGenerating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2)
It is well known that the Lyndon words of length n can be used to construct a basis for the n-th homogeneous component of the free Lie algebra. We develop an algorithm that uses a dynamic programming table to efficiently generate the standard bracketing for all Lyndon words of length n, thus constructing a basis for the n-th homogeneous component of the free Lie algebra. The algorithm runs in l...
متن کاملA fast algorithm to generate Beckett-Gray codes: Extended Abstract
A Gray code is said to be cyclic if the last element and the first element in the sequence also differ by some pre-specified constant amount. The Gray code above demonstrates the cyclic property. It is well known that a cyclic Gray code of binary string corresponds to a Hamilton cycle in the n-dimensional hypercube. Figure 1 shows the 3-dimensional hypercube Q3 with the Hamilton cycle correspon...
متن کاملA New Algorithm for Generating Necklaces
In this paper we present an algorithm for generating the lexicographi cally smallest representatives of all the n bead necklaces in k colors The time required is O nN k where N n k is the number of necklaces with n beads of k colors To our knowledge this is the rst algorithm for this problem which has been proved to asymptotically improve the obvious O n k approach of examining all k ary n tupl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00049-5